New Algebraic Soft Decision Decoding Algorithm for Reed-Solomon Code
نویسنده
چکیده
In this paper, a new algebraic soft-decision decoding algorithm for Reed-Solomon code is presented. It is based on rational interpolation and the interpolation points are constructed by Berlekamp-Messay algorithm. Unlike the traditional Kötter-Vardy algorithm, new algorithm needs interpolation for two smaller multiplicity matrixes, due to the corresponding factorization algorithm for re-constructing codewords.
منابع مشابه
Algebraic Soft-Decision Decoding of Reed–Solomon Codes
A polynomial-time soft-decision decoding algorithm for Reed–Solomon codes is developed. This list-decoding algorithm is algebraic in nature and builds upon the interpolation procedure proposed by Guruswami and Sudan for hard-decision decoding. Algebraic soft-decision decoding is achieved by means of converting the probabilistic reliability information into a set of interpolation points, along w...
متن کاملA Complexity-reduced Interpolation Algorithm for Soft-decision Decoding of Reed-solomon Codes†
Soon after Lee and O’Sullivan proposed a new interpolation algorithm for algebraic soft-decision decoding of Reed-Solomon codes, there have been some attempts to apply a coordinate transformation technique to the new algorithm, with a remarkable complexity reducing effect. In this paper, a conceptually simple way of applying the transformation technique to the interpolation algorithm is propose...
متن کاملTitle of dissertation: PERFORMANCE ANALYSIS OF ALGEBRAIC SOFT-DECISION DECODING OF REED-SOLOMON CODES
Title of dissertation: PERFORMANCE ANALYSIS OF ALGEBRAIC SOFT-DECISION DECODING OF REED-SOLOMON CODES Andrew Duggan, Masters of Science, 2006 Thesis directed by: Professor Alexander Barg Department of Electrical and Computer Engineering We investigate the decoding region for Algebraic Soft-Decision Decoding (ASD) of Reed-Solomon codes in a discrete, memoryless, additive-noise channel. An expres...
متن کاملIterative Algebraic Soft Decision Decoding of Reed-Solomon Codes
In this paper, we propose an iterative soft decision decoding scheme for Reed Solomon codes with near maximum likelihood performance. The advantage of this decoding algorithm over previously proposed algorithms is its fast convergence in terms of the number of iterations required. This is achieved by combining two powerful soft decision decoding techniques which were previously regarded in the ...
متن کاملAlgebraic Soft-Decision Decoding of Reed-Solomon Codes Using Bit-level Soft Information
The performance of algebraic soft-decision decoding (ASD) of Reed-Solomon (RS) codes using bit-level soft information is investigated. Optimal multiplicity assignment strategies (MAS) of ASD with infinite cost are first studied over erasure channels and binary symmetric channels (BSC). The corresponding decoding radii are calculated in closed forms and tight bounds on the error probability are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1407.8069 شماره
صفحات -
تاریخ انتشار 2014